On a strong form of a conjecture of Boyle and Handelman

نویسندگان

  • Assaf Goldberger
  • Michael Neumann
  • ASSAF GOLDBERGER
  • MICHAEL NEUMANN
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Upper Bound on the Characteristic Polynomial of a Nonnegative Matrix Leading to a Proof of the Boyle–handelman Conjecture

In their celebrated 1991 paper on the inverse eigenvalue problem for nonnegative matrices, Boyle and Handelman conjectured that if A is an (n+1)×(n+1) nonnegative matrix whose nonzero eigenvalues are: λ0 ≥ |λi|, i = 1, . . . , r, r ≤ n, then for all x ≥ λ0, (∗) r ∏ i=0 (x− λi) ≤ x − λ 0 . To date the status of this conjecture is that Ambikkumar and Drury (1997) showed that the conjecture is tru...

متن کامل

Ela on a Strong Form of a Conjecture of Boyle and Handelman

The condition (1.1) on λ1, . . . , λn is a well–known necessary condition for n numbers to be the eigenvalues of an n× n nonnegative matrix (see, for example, Berman and Plemmons [3]). Furthermore, from a result due to Friedland [6, Theorem 1], it is known that (1.1) implies that one of the λi’s is nonnegative and majorizes the moduli of the remaining numbers. Assume for the moment, without los...

متن کامل

Algebraic Shift Equivalence and Primitive Matrices

Motivated by symbolic dynamics, we study the problem, given a unital subring 5 of the reals, when is a matrix A algebraically shift equivalent over S to a primitive matrix? We conjecture that simple necessary conditions on the nonzero spectrum of A are sufficient, and establish the conjecture in many cases. If S is the integers, we give some lower bounds on sizes of realizing primitive matrices...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

The Real and the Symmetric Nonnegative Inverse Eigenvalue Problems Are Different

We show that there exist real numbers λ1, λ2, . . . , λn that occur as the eigenvalues of an entry-wise nonnegative n-by-n matrix but do not occur as the eigenvalues of a symmetric nonnegative n-by-n matrix. This solves a problem posed by Boyle and Handelman, Hershkowitz, and others. In the process, recent work by Boyle and Handelman that solves the nonnegative inverse eigenvalue problem by app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017